Fast Generation of Random, Strong Rsa Primes
نویسندگان
چکیده
A number of cryptographic standards currently under development call for the use of strong primes in the generation of an RSA key. This paper suggests a fast way of generating random strong primes that also satisfy a number of other cryptographic requirements. The method requires no more time to generate strong primes than it takes to generate random primes.
منابع مشابه
Digital Signatures from Strong RSA without Prime Generation
We construct a signature scheme that is proved secure, without random oracles, under the strong RSA assumption. Unlike other efficient strong-RSA based schemes, the new scheme does not generate large prime numbers during signing. The public key size and signature size are competitive with other strong RSA schemes, but verification is less efficient. The new scheme adapts the prefix signing tech...
متن کاملFast Generation of Prime Numbers and
A very eecient recursive algorithm for generating nearly random prov-able primes is presented. The expected time for generating a prime is only slightly greater than the expected time required for generating a pseudo-prime of the same size that passes the Miller-Rabin test for only one base. Therefore our algorithm is even faster than presently-used algorithms for generating only pseudo-primes ...
متن کاملAre 'Strong' Primes Needed for RSA
We review the arguments in favor of using so called strong primes in the RSA public key cryptosystem There are two types of such arguments those that say that strong primes are needed to protect against factoring attacks and those that say that strong primes are needed to protect against cycling attacks based on repeated encryption We argue that contrary to common belief it is unnecessary to us...
متن کاملThe Equivalence of Strong RSA and Factoring in the Generic Ring Model of Computation
Let N be the result of an RSA modulus generation, i.e., a random variable distributed according to some appropriate distribution over the set of products of two primes, such that factoring N is believed to be hard. The Strong RSA assumption states that, given an x chosen uniformly at random from ZN , it is computationally infeasible to compute a y ∈ ZN and an e ∈ N \ {1} such that y ≡ x (mod N)...
متن کاملInterrelation Among RSA Security, Strong Primes, and Factoring
The security of RSA depends critically on the inability of an adversary to compute private key from the public key. The problem of computing private key from public key is equivalent to the problem of factoring n into its prime factors. Therefore it is important for the RSA user to select prime numbers in such a way that the problem of factoring n is computationally infeasible for an adversary....
متن کامل